An evolutionary scheme for decision tree construction
نویسندگان
چکیده
منابع مشابه
Ant Algorithm For Construction Of Evolutionary Tree
This paper proposes an Ant algorithm implemented with stack count for the purpose of designing suffix representations of tree structures. The algorithm is applied to the problem of reconstructing an evolutionary tree from nucleotide sequences. The algorithm shows compatible results in simulated experiment and alignment of protein sequences from 15 species against the existing algorithms.
متن کاملFeature Selection as an Improving Step for Decision Tree Construction
The removal of irrelevant or redundant attributes could benefit us in making decisions and analyzing data efficiently. Feature Selection is one of the most important and frequently used techniques in data preprocessing for data mining. In this paper, special attention is made on feature selection for classification with labeled data. Here an algorithm is used that arranges attributes based on t...
متن کاملAn Evolutionary Algorithm for Oblique Decision Tree Induction
In the paper, a new evolutionary approach to induction of oblique decision trees is described. In each non-terminal node, the specialized evolutionary algorithm is applied to search for a splitting hyperplane. The feature selection is embedded into the algorithm, which allows to eliminate redundant and noisy features at each node. The experimental evaluation of the proposed approach is presente...
متن کاملClustering Via Decision Tree Construction
Clustering is an exploratory data analysis task. It aims to find the intrinsic structure of data by organizing data objects into similarity groups or clusters. It is often called unsupervised learning because no class labels denoting an a priori partition of the objects are given. This is in contrast with supervised learning (e.g., classification) for which the data objects are already labeled ...
متن کاملPrinciples of Optimal Probabilistic Decision Tree Construction
Probabilistic (or randomized) decision trees can be used to compute Boolean functions. We consider two types of probabilistic decision trees one has a certain probability to give correct answer (but can also give nothing at all) and is not allowed to give wrong answers, but other always manages to give correct answer, but may require more computation. We provide a method, which can be used to c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Knowledge-Based Systems
سال: 2017
ISSN: 0950-7051
DOI: 10.1016/j.knosys.2016.12.011